Improving the Performance of Multiobjective Evolutionary Optimization Algorithms Using Coevolutionary Learning
نویسندگان
چکیده
This chapter introduces two algorithms for multiobjective optimization. These algorithms are based on a state-of-the-art Multiobjective Evolutionary Algorithm (MOEA) called Strength Pareto Evolutionary Algorithm 2 (SPEA2). The first proposed algorithm implements a competitive coevolution technique within SPEA2. In contrast, the second algorithm introduces a cooperative coevolution technique to SPEA2. Both novel coevolutionary approaches are then compared to the original SPEA2 in seven scalable DTLZ test problems with 3 to 5 objectives. Overall, the optimization results show that the two proposed approaches are superior to the original SPEA2 with regard to the average distance of the nondominated solutions to the true Pareto front, the diversity of the obtained solutions and also the coverage level. In addition, t-tests have been conducted to validate the significance of the improvements obtained by the augmented algorithms over the original SPEA2. Finally, cooperative coevolution is found to be better than competitive coevolution in terms of enhancing the performance of the original SPEA2. © 2009 Springer-Verlag Berlin Heidelberg.
منابع مشابه
Comparing a Coevolutionary Genetic Algorithm for Multiobjective Optimization
We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these p...
متن کاملGame Theory Based Coevolutionary Algorithm: A New Computational Coevolutionary Approach
Game theory is a method of mathematical analysis developed to study the decision making process. In 1928, Von Neumann mathematically proved that every two-person, zerosum game with many pure finite strategies for each player is deterministic. In the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann’s theorem. Another central achievement of game theory i...
متن کامل Structure Learning in Bayesian Networks Using Asexual Reproduction Optimization
A new structure learning approach for Bayesian networks (BNs) based on asexual reproduction optimization (ARO) is proposed in this letter. ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survi...
متن کاملPreferences and their application in evolutionary multiobjective optimization
The paper describes a new preference method and its use in multiobjective optimisation. These preferences are developed with a goal to reduce the cognitive overload associated with the relative importance of a certain criterion within a multiobjective design environment involving large numbers of objectives. Their successful integration with several genetic algorithm–based design search and opt...
متن کاملProposing a Novel Cost Sensitive Imbalanced Classification Method based on Hybrid of New Fuzzy Cost Assigning Approaches, Fuzzy Clustering and Evolutionary Algorithms
In this paper, a new hybrid methodology is introduced to design a cost-sensitive fuzzy rule-based classification system. A novel cost metric is proposed based on the combination of three different concepts: Entropy, Gini index and DKM criterion. In order to calculate the effective cost of patterns, a hybrid of fuzzy c-means clustering and particle swarm optimization algorithm is utilized. This ...
متن کامل